GRAPHICAL SOLUTION OF QUADRATIC WITH COMPLEX ROOTS

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Protection of Sensitive Messages Based on Quadratic Roots of Gaussians: Groups with Complex Modulus

This paper considers three algorithms for the extraction of square roots of complex integers {called Gaussians} using arithmetic based on complex modulus p + iq. These algorithms are almost twice as fast as the analogous algorithms extracting square roots of either real or complex integers in arithmetic based on modulus p, where p is a real prime. A cryptographic system based on these algorithm...

متن کامل

Graphical patterns in quadratic residues

Plots of quadratic residues display some visual features that are analyzed mathematically in this paper. The graphical patterns of quadratic residues modulo m depend only on the residues of m modulo the lowest positive integers.

متن کامل

Primitive Roots in Quadratic Fields

We consider an analogue of Artin’s primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of Artin’s conjecture is that there are infinitely many such inert primes for which this order is maximal. This is known at present only under the Generalized ...

متن کامل

Weyl Sums for Quadratic Roots

The most powerful methods for handling these sums exploit the modern theory of automorphic forms; see [DFI1] for spectral aspects and [DIT] for more arithmetical connections. The sum (1.1) has only a few terms, bounded by the divisor function, so there is not much room for cancellation, but for applications there is a lot of interest in bounds for sums of these as the modulus c varies, say (1.2...

متن کامل

Products Of Quadratic Polynomials With Roots Modulo Any Integer

We classify products of three quadratic polynomials, each irreducible over Q, which are solvable modulo m for every integer m > 1 but have no roots over the rational numbers. Polynomials with this property are known as intersective polynomials. We use Hensel’s Lemma and a refined version of Hensel’s Lemma to complete the proof. Mathematics Subject Classification: 11R09

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: School Science and Mathematics

سال: 1911

ISSN: 0036-6803

DOI: 10.1111/j.1949-8594.1911.tb03359.x